منابع مشابه
Imagining Clp(, ) Imagining Clp(, )
We study under which conditions the domain of-terms (() and the equality theory of the-calculus () form the basis of a usable constraint logic programming language (CLP). The conditions are that the equality theory must contain axiom , and the formula language must depart from Horn clauses and accept universal quantiications and implications in goals. In short, CLP((,) must be close to Prolog. ...
متن کاملSchwarz Triangle Mappings and Teichmüller Curves: Abelian Square-tiled Surfaces
We consider normal covers of CP with abelian deck group, branched over at most four points. Families of such covers yield arithmetic Teichmüller curves, whose period mapping may be described geometrically in terms of Schwarz triangle mappings. These Teichmüller curves are generated by abelian square-tiled surfaces. We compute all individual Lyapunov exponents for abelian squaretiled surfaces, a...
متن کاملCLP(PB), A Meta-Interpreter in CLP(R)
Constraint logic programming is one of the most attractive research areas in logic programming. Due to [JL87] the theoretical foundation of a general constraint logic programming language scheme CLP(X ) is available. Unfortunately, implementing a CLP(X ) system for some domain X is a difficult task. The problematic points are providing a constraint solver and ensuring the incrementality of the ...
متن کاملComposition in Hierarchical CLP
We propose a variant of the Hierarchical Constraint Logic Programming (HCLP) scheme of Borning, Wilson, and others. We consider compositionality and incrementality in Constraint Logic Programming, introduce HCLP, and present Wilson's proof that it is non-compositional. We define a scheme for composing together solutions to individual hierarchies and show that hierarchy composition can be expres...
متن کاملModeling Systems in CLP
We present a methodology for the modeling of complex program behavior in CLP. In the first part we present an informal description about how to represent a system in CLP. At its basic level, this representation captures the trace semantics of concurrent programs, or even high-level specifications, in the form of a predicate transformer. Based on traces, the method can also capture properties of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2019
ISSN: 0002-9939,1088-6826
DOI: 10.1090/proc/14214